Analysis of Texture Synthesis Algorithms with Respect to Usage for Hole-Filling in 3D Geometry

The development of range scanning technology has offered new possibilities to capture large datasets in computer graphics. Due to physical restrictions, captured 3D objects can contain holes that need to be filled automatically. In a different area of interest, the field of texture synthesis, research has been done on a solution for a similar 2D problem. To utilize available methods, the challenge is to find similarities and show the differences between these problems. Hereby a 3D prototype is developed on the basis of an analysis of chosen texture synthesis algorithms, projecting the problem onto an intermediate 2D algorithm. The presented solution works fast and at good quality on artificial and real-world examples.